Monotone Drawings of Graphs 1 Patrizio Angelini
نویسندگان
چکیده
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between monotonicity, planarity, and convexity, and we outline a number of open problems and future research directions.
منابع مشابه
Monotone Drawings of Graphs
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between monotonicity, planarity, and convexity, and we outl...
متن کاملUniversal Point Sets for Drawing Planar Graphs with Circular Arcs
We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a planar drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc. Submitted: October 2013 Reviewed: February 2014 Revised: March 2014 Accepted: April 2014 Final: May 2014 Published: May 2014 Article type: Regular paper Communicat...
متن کاملAn Algorithm to Construct Greedy Drawings of Triangulations
We show an algorithm to construct a greedy drawing of every given triangulation. The algorithm relies on two main results. First, we show how to construct greedy drawings of a fairly simple class of graphs, called triangulated binary cactuses. Second, we show that every triangulation can be spanned by a triangulated binary cactus. Further, we discuss how to extend our techniques in order to pro...
متن کاملL-Drawings of Directed Graphs
We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of matrix representations. In an L-drawing, vertices have exclusive xand y-coordinates and edges consist of two segments, one exiting the source vertically and one entering the destination horizontally. We study the problem of c...
متن کاملStraight-Line Rectangular Drawings of Clustered Graphs
We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006 ].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011